Relating Branching Program Size and Formula Size over the Full Binary Basis
نویسندگان
چکیده
Circuit size, branching program size, and formula size of Boolean functions, denoted by C(f), BP(f), and L(f), are the most important complexity measures for Boolean functions. Often also the formula size L (f) over the restricted basis f_;^;:g is considered. It is well-known that C(f) 3BP(f), BP(f) L (f), L (f) L(f)2, and C(f) L(f) 1. These estimates are optimal. But the inequality BP(f) L(f)2 can be improved to BP(f) 1:360L(f) , where = log4(3 +p5) < 1:195.
منابع مشابه
A Note on Nečiporuk’s Method for Nondeterministic Branching Programs
Nečiporuk [Nec̆66] gave a method based on counting subfunctions to lower bound the formula size over an arbitrary binary basis and contact scheme (or Boolean branching program) size required to compute explicit n-input Boolean functions. Pudlak [Pud87] observed that Nečiporuk’s method also yields an Ω(n/ log n) lower bound on switching-and-rectifier network size as well as nondeterministic branc...
متن کاملSubquadratic Simulations of Balanced Formulae by Branching Programs
This paper considers Boolean formulae and their simulations by bounded width branching programs. It is shown that every balanced Boolean formula of size s can be simulated by a constant width (width 5) branching program of length s 1.81 l.... A lower bound for the translational cost from formulae to permutation branching programs is also presented. Key words, branching programs, Boolean formula...
متن کاملUpper bounds for the formula size of the majority function
It is shown that the counting function of n Boolean variables can be implemented with the formulae of size O(n3.06) over the basis of all 2-input Boolean functions and of size O(n4.54) over the standard basis. The same bounds follow for the complexity of any threshold symmetric function of n variables and particularly for the majority function. Any bit of the product of binary numbers of length...
متن کاملFractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a rooted, balanced dary tree of height h, whose internal nodes are labelled with d-ary functions on [k] = {1, . . . , k}, and whose leaves are labelled with elements of [k]. Each node obtains a value in [k] equal to its d-ary...
متن کاملCompression of Boolean Functions
We consider the problem of compression for “easy” Boolean functions: given the truth table of an n-variate Boolean function f computable by some unknown small circuit from a known class of circuits, find in deterministic time poly(2) a circuit C (no restriction on the type of C) computing f so that the size of C is less than the trivial circuit size 2/n. We get both positive and negative result...
متن کامل